This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...

The Tchebychev distance on fuzzy sets (FSs) has been proposed to construct a measure of proximity between two modalities in two-dimensional statistical description. parameterized symmetric difference operations and cardinality for intuitionistic (IFSs) proposed. This paper extends set the possibility sets. More precisely, we firstly use IFSs propose IFSs. From these, then deduce examples metric...

Corresponding Author: Zahir M. Hussain Faculty of Computer Science and Math, University of Kufa, Iraq Email: [email protected] Abstract: This work presents a new holistic measure for face recognition. Face recognition involves three steps: Face Detection, Feature Extraction and Matching. In the face detection process to identify the face area in face images, Viola-Jones algorithm has been used...

In the present paper, a twin pair (xn, yn) and (Xn, Yn) of numbers related to one and two variable Tchebychev polynomials of first and second kinds are proposed. Certain Combinatorial Identities of the twin pairs are stated and proved.

Let S be a complete, open simply connected surface. Suppose that the integral of the Gauss curvature over arbitrary measurable sets is less than tt/2 in magnitude. We show that the surface admits a global Tchebychev net.

In this paper, we study locally strongly convex Tchebychev hypersurfaces, namely the {\it centroaffine totally umbilical hypersurfaces}, in $(n+1)$-dimensional affine space $\mathbb{R}^{n+1}$. We first make an ordinary-looking observation that such hypersurfaces are characterized by having a Riemannian structure admitting canonically defined closed conformal vector field. Then, taking advantage...

The three-dimensional Fermat-Weber facility location problem with Tchebychev distances is investigated. Expanding on previous research for the analogous two-dimensional problem, this study presents a new algorithm for solving the elusive three-dimensional case. The algorithm presented herein finds near optimal solutions in practical computational times. Some experimental results are also convey...